package DataStructure.tree.practice;

import DataStructure.tree.TreeNode;

/**
 * 404. 左叶子之和 https://leetcode.cn/problems/sum-of-left-leaves
 */
public class SumOfLeftLeaves {

    public int sumOfLeftLeaves(TreeNode root) {
        if(root == null) return 0;
        if(root.left != null && root.left.left == null && root.left.right == null)
            return root.left.val + sumOfLeftLeaves(root.right);
        else
            return sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.right);
    }
}
